Optimization of Blind Spoofing Using Discrete Model

نویسندگان

  • Rengarajan Alwar
  • Sugumar Rajendran
  • Saravanakumar Selvaraj
چکیده

In order to improve the optimizing efficiency, one dimensional blind-walking optimization method is proposed, which can be realized by halving step or doubling step for the applicability test condition of the sensing point. The optimum point, then, can be reached at high rate by doubling step and converged by halving step. Current point should be updated in whole design space. The flow chart of this algorithm with operating process is put forward. And then, two optimization problems with uni-modal and multimodal objective functions are solved respectively. The simulation results show that the proposed method is better than the ordinary method, which has the advantages of fast convergence speed, less calculating amounts, and wide application scope, etc. Taking the method as innovative kernel, random research method, feasible direction method and other complex methods are improved. Its characteristics are suitable for vivid teaching like interpreting. The linear subspace-based blind and group-blind multiuser detectors recently developed represent a robust and efficient adaptive multiuser detection technique for code-division multiple-access (CDMA) systems. In this paper, we consider adaptive transmitter optimization strategies for CDMA systems operating in fading multipath environments in which these detectors are employed. We make use of more recent results on the analytical performance of these blind and group-blind receivers in the design and analysis of the transmitter optimization techniques. In particular, we develop a maximum-eigenvector-based method of optimizing spreading codes for given channel conditions and a utility-based power control algorithm for CDMA systems with blind or group-blind multiuser detection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

متن کامل

Continuous Discrete Variable Optimization of Structures Using Approximation Methods

Optimum design of structures is achieved while the design variables are continuous and discrete. To reduce the computational work involved in the optimization process, all the functions that are expensive to evaluate, are approximated. To approximate these functions, a semi quadratic function is employed. Only the diagonal terms of the Hessian matrix are used and these elements are estimated fr...

متن کامل

DISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM

Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...

متن کامل

Engineering science Seismic Wavelet Signal Noise Reduction Algorithm of Blind Source Separation Optimization

In view of the existing seismic signal analysis model there are some problems is Analysis of the result is bad, the accuracy is not high. This paper puts forward an algorithm based on discrete wavelet and generalized the ICA model of seismic signal analysis. First for continuous Wavelet transform exists redundant of problem, on standard small wave transform algorithm of transform domain in the ...

متن کامل

DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM

Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012